Falconer distance problem, additive energy and Cartesian products
نویسندگان
چکیده
منابع مشابه
Additive Energy and the Falconer Distance Problem in Finite Fields
We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of the Fourier transform on given sets. As an application of our observation, we find sufficient conditions on sets where the Falconer distance conjecture for fin...
متن کاملThe Erdös-Falconer Distance Problem on the Unit Sphere in Vector Spaces Over Finite Fields
Hart, Iosevich, Koh and Rudnev (2007) show, using Fourier analysis method, that the finite Erdös-Falconer distance conjecture holds for subsets of the unit sphere in Fdq . In this note, we give a graph theoretic proof of this result.
متن کاملK–Distance Sets, Falconer Conjecture, and Discrete Analogs
In this paper we prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a diophantine mechanism to convert continuous results into distance set estimates for discrete point sets.
متن کاملEndpoint bounds for the non-isotropic Falconer distance problem associated with lattice-like sets
Let S ⊂ R be contained in the unit ball. Let ∆(S) = {||a− b|| : a, b ∈ S}, the Euclidean distance set of S. Falconer conjectured that the ∆(S) has positive Lebesque measure if the Hausdorff dimension of S is greater than d 2 . He also produced an example, based on the integer lattice, showing that the exponent d 2 cannot be improved. In this paper we prove the Falconer distance conjecture for t...
متن کاملHomogeneous cartesian products
A graph G is 1-homogeneous if certain isomorphisms between similarly embedded induced subgraphs of G extend to automorphisms of G. We show that the only connected composite 1-homogeneous graphs are the cube, and Kn ×K2 and Kn ×Kn with n ≥ 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Academiae Scientiarum Fennicae Mathematica
سال: 2016
ISSN: 1239-629X,1798-2383
DOI: 10.5186/aasfm.2016.4135